11511 - Frieze Patterns/frieze.2.cpp

   1 /*
   2   Accepted
   3  */
   4 #include<iostream>
   5 #include<cstdio>
   6 #include<vector>
   7 using namespace std;
   8
   9 unsigned long long f[1005][1005];
  10
  11 int main(){
  12   int n, row, col;
  13   while (cin >> n >> row >> col && n){
  14
  15     for (int i=1; i<=n; ++i) cin >> f[i][1];
  16
  17     for (int j=1; j<=n+1; ++j) f[1][j] = f[n][j] = 1;
  18
  19     for (int j=2; j<=n+1; ++j)
  20       for (int i=2; i<n; ++i)
  21         f[i][j] = (f[i+1][j-1]*f[i-1][j]+1)/f[i][j-1];
  22
  23
  24     /*
  25     for (int i=1; i<=n; ++i){
  26       for (int j=1; j<=n+1; ++j)
  27         printf("%3d ", f[i][j]);
  28       puts("");
  29     }
  30     */
  31
  32     while (col > n+1) col -= n+1;
  33
  34     cout << f[row][col] << endl;
  35   }
  36   return 0;
  37 }